Direct Zero Knowledge Proofs of Computational Power in Five Rounds
نویسندگان
چکیده
Zero-knowledge proofs of compaiaiional power have been proposed by Yung and others. In this paper, we propose an ef ic ieni (direct) and consiani round (five round) construction of zero knowledge proofs of computational power. To formulate the classes that can be applied to these efficient protocols, we introduce a class of invulnerable problems, FewPR and FewPRu. We show that any invulnerable problem in FewPR and FewPRu has an efficient and constant round zero knowledge proof of computational power, assuming the existence of a one-way function. We discuss some applications of these zero-knowledge proofs of computational power.
منابع مشابه
Instance-Dependent Commitment Schemes and the Round Complexity of Perfect Zero-Knowledge Proofs
We study the question whether the number of rounds in public-coin perfect zero-knowledge (PZK) proofs can be collapsed to a constant. Despite extensive research into the round complexity of interactive and zero-knowledge protocols, there is no indication how to address this question. Furthermore, the main tool to tackle this question is instance-dependent commitments, but currently such schemes...
متن کاملGeneral Properties of Quantum Zero-Knowledge Proofs
This paper studies general properties of quantum zeroknowledge proof systems. Among others, the following properties are proved on quantum computational zero-knowledge proofs: – Honest-verifier quantum zero-knowledge equals general quantum zero-knowledge. – Public-coin quantum zero-knowledge equals general quantum zeroknowledge. – Quantum zero-knowledge with perfect completeness equals general ...
متن کاملConcurrent Zero Knowledge Proofs with Logarithmic Round-Complexity
We consider the problem of constructing Concurrent Zero Knowledge Proofs [6], in which the fascinating and useful “zero knowledge” property is guaranteed even in situations where multiple concurrent proof sessions are executed with many colluding dishonest verifiers. Canetti et al. [3] show that blackbox concurrent zero knowledge proofs for non-trivial languages require Ω̃(log k) rounds where k ...
متن کاملOn Concurrent and Resettable Zero-Knowledge Proofs for NP
A proof is concurrent zero-knowledge if it remains zero-knowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. It is known that zeroknowledge is not necessarily preserved in such an environment [24, 29, 4]. Designing concurrent zero-knowledge proofs is a fundamental issue in the study of zero-knowledge since known zeroknowledge protocols cannot be ...
متن کاملZero-Knowledge Blind Identification For Smart Cards Using Bilinear Pairings
In identification protocols with public verifier coins (like Fiat-Shamir), a passive adversary watching the communication gains information intended only for the verifier. On the other hand, private coin protocols with fewer than three rounds cannot be zero-knowledge. In this paper, we introduce the notion of bounded-prover zero-knowledge proofs which require only two rounds and can be consider...
متن کامل